Approximating the maxmin-angle covering triangulation
نویسندگان
چکیده
منابع مشابه
Approximating the Maxmin-angle Covering Triangulation
Given a planar straight line graph we seek a covering triangulation whose minimumangle is as large as possible A covering triangulation is a Steiner triangulation with the following restriction No Steiner vertices may be added on an input edge We give an explicit upper bound on the largest possible minimum angle in any covering triangulation of a given input This upper bound depends only on loc...
متن کاملThe Complexity of MaxMin Length Triangulation
In 1991, Edelsbrunner and Tan gave an O(n) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin Length triangulation is an NPcomplete problem. The proof implies that (unless P=NP), there is no polynomial-time approximation algorithm that can approximate the ...
متن کاملFinding a Covering Triangulation Whose Maximum Angle is Provably Small
We consider the following problem given a pla nar straight line graph nd a covering triangulation whose maximum angle is as small as possible A cov ering triangulation is a triangulation whose vertex set contains the input vertex set and whose edge set con tains the input edge set The covering triangulation problem di ers from the usual Steiner triangulation problem in that we may not add a ver...
متن کاملApproximating the Minimum Weight Steiner Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtrees. In O(n log n) time we can compute a triangulation with O(n) new points, and no obtuse triangles, that approximates the MWST. We can also approximate the MWST with triangulations having no sharp angles. We generali...
متن کاملOn Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and have applications in biology ranging from fullsibling reconstructions in wild populations to biomolecular clusterings; however, as this paper shows, their appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1997
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00046-1